The Capacity of Memoryless Channels With Sampled Cyclostationary Gaussian Noise
نویسندگان
چکیده
منابع مشابه
Secrecy Capacity of Colored Gaussian Noise Channels with Feedback
In this paper, the k-th order autoregressive moving average (ARMA(k)) Gaussian wiretap channel with noiseless causal feedback is considered, in which an eavesdropper receives noisy observations of the signals in both forward and feedback channels. It is shown that a variant of the generalized Schalkwijk-Kailath scheme, a capacity-achieving coding scheme for the feedback Gaussian channel, achiev...
متن کاملCommitment Capacity of Discrete Memoryless Channels
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It turns out that the answer is very intuitive: it is the maximum equivocation of the channel (after removing trivial redundancy), even when unlimited noiseless bid...
متن کاملUniversal decoding for memoryless Gaussian channels with a deterministic interference
A universal decoding procedure is proposed for memoryless Gaussian channels with deterministic interfering signals from a certain class. The universality of the proposed decoder is in the sense of W i g independent of the channel parameters and the unknown interfering signal, and at the same time attaining the same random coding e m r exponent as the optimal maximum likelihood (ML) decoder, whi...
متن کاملCapacity of Block-Memoryless Channels with Causal Channel Side Information
The capacity of a time-varying block-memoryless channel in which the transmitter and the receiver have access to (possibly different) noisy causal channel side information (CSI) is obtained. It is shown that the capacity formula obtained in this correspondence reduces to the capacity formula reported in [1] for the special case where the transmitter CSI is a deterministic function of the receiv...
متن کاملNumerical Computation of the Capacity of Continuous Memoryless Channels
We extend the Blahut-Arimoto algorithm to continuous memoryless channels by means of sequential Monte Carlo integration in conjunction with steepest descent. As an illustration, we consider the peak power constrained AWGN channel.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2020
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2019.2945785